منابع مشابه
Notes on Polynomially Bounded Arithmetic
We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
متن کاملOn Polynomially Bounded Weighted Shifts
(1) ‖p(T )‖ ≤M sup{|p(ζ)| : |ζ| = 1} ∀ polynomial p, and to be power bounded (notation T ∈ (PW)) if (1) holds for every polynomial of the special form p(ζ) = ζ where n is a positive integer. If T ∈ (PB) [resp., T ∈ (PW)], then there is a smallest number M which satisfies (1) [resp., (1) restricted]. This number will be called the polynomial bound of T [resp., the power bound of T ] and denoted ...
متن کاملPolynomially bounded C0-semigroups
We characterize generators of polynomially bounded C0-semigroups in terms of an integrability condition for the second power of the resolvent on vertical lines. This generalizes results by Gomilko, Shi and Feng on bounded semigroups and by Malejki on polynomially bounded groups.
متن کاملPolynomially Bounded Recursive Realizability
A polynomially bounded recursive realizability, in which the recursive functions used in Kleene’s realizability are restricted to polynomially bounded functions, is introduced. It is used to show that provably total functions of Ruitenburg’s Basic Arithmetic are polynomially bounded (primitive) recursive functions. This sharpens our earlier result where those functions were proved to be primiti...
متن کاملPolynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are polynomially bounded. It includes the method of upper triangular interpretations as a special case, and we prove that the inclusion is strict. The criterion can be expressed as a finite domain constraint system. It trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 1996
ISSN: 0022-4812,1943-5886
DOI: 10.2307/2275794